Abstract of doctoral thesis entitled GA-BASED CONTROL OF MULTIOBJECTIVE FLEXIBLE JOB SHOP SCHEDULING PROCESSES

نویسنده

  • NICOLAE PARASCHIV
چکیده

of doctoral thesis entitled GA-BASED CONTROL OF MULTIOBJECTIVE FLEXIBLE JOB SHOP SCHEDULING PROCESSES Doctoral student: math. ec. ELENA SIMONA NICOARĂ Doctoral advisor: prof. NICOLAE PARASCHIV In the beginning of this work, the manufacturing systems are hierarchically approached on three levels: the first one corresponds to the global enterprise, the second one to the production planning sector and the third level corresponds to the scheduling sector. A Job Shop Scheduling (JSS) problem tries to allocate a finite set of resources over time to a finite set of different jobs in a minimum time, while satisfying temporal and resource constraints. Each job has a fixed order of operations, these are to be processed on a specific machine for a specified duration and the solution of the problem is an optimal schedule (an optimal table of starting times for each operation of all jobs). The thesis focuses on Multiobjective Flexible Job Shop Scheduling (MOFJSS) problems, which are tackled as scheduling processes; the flexibility considered here is a type II flexibility (the routings of the jobs on the resources are flexible) and the processes objectives are three: minimizing the makespan, reducing the number of late jobs and minimizing the average ratio of the idleness time of the jobs. The author extends the mathematical framework associated to the JSS problems to a formal definition of the MOFJSS processes within the systems theory context, by specifying the process hypothesis, the input, the state and the output variables, the constraints and the objective. The hall-mark of these processes consists in their high level of complexity, mainly conditioned by the huge dimension of the search space, by the difficulty in the representation, by the hard constraints and the enormous effort to evaluate the candidatesolutions. The primary contributions of the thesis address a poorly approached direction in the literature, namely the systemic modeling of the optimization processes control based on genetic algorithms. These contributions consist in the following aspects: providing a procedural model for the optimal control of MOFJSS processes based on genetic algorithms; designing a particular genetic algorithm enriched with a control strategy able to avoid the premature convergence of the genetic algorithm to suboptimal regions of the search space (imperative for the complex processes); proving the model viability by experiments on two deterministic scheduling processes in the manufacturing area, approached as uniobjective and multiobjective

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Flexible Job Shop Scheduling Problem with Controllable Processing Times to Optimize Total Cost of Delay and Processing

In this paper, the flexible job shop scheduling problem with machine flexibility and controllable process times is studied. The main idea is that the processing times of operations may be controlled by consumptions of additional resources. The purpose of this paper to find the best trade-off between processing cost and delay cost in order to minimize the total costs. The proposed model, flexibl...

متن کامل

Optimality of the flexible job shop scheduling system based on Gravitational Search Algorithm

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

متن کامل

Optimality of the flexible job shop scheduling system based on Gravitational Search Algorithm

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

متن کامل

Flexible job shop scheduling under availability constraints

In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...

متن کامل

Multiobjective Genetic Algorithm for Scheduling Problems in Manufacturing Systems

Scheduling is an important tool for a manufacturing system, where it can have a major impact on the productivity of a production process. In manufacturing systems, the purpose of scheduling is to minimize the production time and costs, by assigning a production facility when to make, with which staff, and on which equipment. Production scheduling aims to maximize the efficiency of the operation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011